Communicability Angles Reveal Critical Edges for Network Consensus Dynamics
نویسندگان
چکیده
We consider the question of determining how the topological structure influences a consensus dynamical processes taking place on a network. By considering a large data set of real-world networks we first determine that the removal of edges according to their communicability angle, an angle between position vectors of the nodes in an Euclidean communicability space, increases the average time of consensus by a factor of 5.68 in real-world networks. The edge betweenness centrality also identifies, in a smaller proportion, those critical edges for the consensus dynamics; i.e., its removal increases the time of consensus by a factor of 3.70. We justify theoretically these findings on the basis of the role played by the algebraic connectivity and the isoperimetric number of networks on the dynamical process studied and their connections with the properties mentioned before. Finally, we study the role played by global topological parameters of networks on the consensus dynamics. We determine that the network density and the average distance-sum, which is analogous of the node degree for shortest-path distances, account for more than 80% of the variance of the average time of consensus in the real-world networks studied.
منابع مشابه
Updating and downdating techniques for optimizing network communicability
The total communicability of a network (or graph) is defined as the sum of the entries in the exponential of the adjacency matrix of the network, possibly normalized by the number of nodes. This quantity offers a good measure of how easily information spreads across the network, and can be useful in the design of networks having certain desirable properties. The total communicability can be com...
متن کاملEdge modification criteria for enhancing the communicability of digraphs
We introduce new broadcast and receive communicability indices that can be used as global measures of how effectively information is spread in a directed network. Furthermore, we describe fast and effective criteria for the selection of edges to be added to (or deleted from) a given directed network so as to enhance these network communicability measures. Numerical experiments illustrate the ef...
متن کاملCommunicability and geometry of complex networks
I will introduce some basic concepts of network theory, in particular the small-worldness and how the communication is though to flow in networks. Then, I will motivate and introduce the concept of communicability. I will show the way to formulate this concept mathematically. I will show a few applications of this concept in different areas, such as material sciences, human brain diseases and b...
متن کاملAdaptive Neural Network Method for Consensus Tracking of High-Order Mimo Nonlinear Multi-Agent Systems
This paper is concerned with the consensus tracking problem of high order MIMO nonlinear multi-agent systems. The agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. The communication network topology of agents is assumed to be a fixed undirected graph. A distributed adaptive control method is proposed to solve the consensus problem utilizing re...
متن کاملCommunicability Angle and the Spatial Efficiency of Networks
We introduce the concept of communicability angle between a pair of nodes in a graph. We provide strong analytical and empirical evidence that the average communicability angle for a given network accounts for its spatial efficiency on the basis of the communications among the nodes in a network. We determine characteristics of the spatial efficiency of more than a hundred real-world networks t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 92 5 شماره
صفحات -
تاریخ انتشار 2015